An Introduction to Classical Cyclic Polling Model
نویسنده
چکیده
An alternative analysis of the classical M/G/1 cyclic order polling model is presented. We introduce the new Markov regenerative process framework, which provides a way to perform the analysis of the polling model on a unified, i.e. service discipline independent way. We derive the decomposition property and the general expressions of the stationary number of customers as well as the stationary waiting time. We show a unified way to reduce the analysis for finding the stationary number of customers at the polling epochs and demonstrate it on several known service disciplines. The tutorial character of the approach makes it appropriate to be used for an introduction.
منابع مشابه
Queueing in Space: design of Message Ferry Routes in static adhoc networks
We study the concept of Ferry based Wireless Local Area Network (FWLAN), in which a number of isolated nodes are scattered over some area and where communication between a node and the outer world, or communication between the nodes, are made possible via a message ferry. The Ferry has a predetermined cyclic path which collects packets from a node and delivers packets to it when it is in the vi...
متن کاملHeavy traffic analysis of polling models by mean value analysis
In this paper we present a new approach to derive heavy-traffic asymptotics for polling models. We consider the classical cyclic polling model with exhaustive or gated service at each queue, and with general service-time and switch-over time distributions, and study its behavior when the load tends to one. For this model, we explore the recently proposed mean value analysis (MVA), which takes a...
متن کاملContinuous polling models and application to ferry assisted WLAN
In this paper we focus on a class of polling systems encountered while modeling the ferry based wireless local area network (FWLAN). A moving ferry, while walking in a predetermined cyclic path, communicates with the static nodes (or users) of the network via a wireless link. The ferry is assumed to stop and communicate with a node that has a packet to send or to receive, when it is closest to ...
متن کاملPolling models with renewal arrivals: A new method to derive heavy-traffic asymptotics
We consider asymmetric cyclic polling systems with an arbitrary number of queues, general service-time distributions, zero switch-over times, gated service at each queue, and with general renewal arrival processes at each of the queues. For this classical model, we propose a new method to derive closed-form expressions for the expected delay at each of the queues when the load tends to 1, under...
متن کاملDesign of Message Ferry Routes in sensor networks
In this paper we focus on a class of polling systems encountered while modeling the ferry based wireless local area network (FWLAN). A moving ferry, while walking in a predetermined cyclic path, communicates with the static nodes (or users) of the network via a wireless link. The ferry is assumed to stop and communicate with a node that has a packet to send or to receive, when it is closest to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007